Graph-based Semi-supervised Learning: Realizing Pointwise Smoothness Probabilistically
نویسندگان
چکیده
As the central notion in semi-supervised learning, smoothness is often realized on a graph representation of the data. In this paper, we study two complementary dimensions of smoothness: its pointwise nature and probabilistic modeling. While no existing graph-based work exploits them in conjunction, we encompass both in a novel framework of Probabilistic Graph-based Pointwise Smoothness (PGP), building upon two foundational models of data closeness and label coupling. This new form of smoothness axiomatizes a set of probability constraints, which ultimately enables class prediction. Theoretically, we provide an error and robustness analysis of PGP. Empirically, we conduct extensive experiments to show the advantages of PGP.
منابع مشابه
A Sampling Theory Perspective of Graph-based Semi-supervised Learning
Graph-based methods have been quite successful in solving unsupervised and semi-supervised learning problems, as they provide a means to capture the underlying geometry of the dataset. It is often desirable for the constructed graph to satisfy two properties: first, data points that are similar in the feature space should be strongly connected on the graph, and second, the class label informati...
متن کاملReLISH: Reliable Label Inference via Smoothness Hypothesis
The smoothness hypothesis is critical for graph-based semi-supervised learning. This paper defines local smoothness, based on which a new algorithm, Reliable Label Inference via Smoothness Hypothesis (ReLISH), is proposed. ReLISH has produced smoother labels than some existing methods for both labeled and unlabeled examples. Theoretical analyses demonstrate good stability and generalizability o...
متن کاملPhonetic Classification Using Controlled Random Walks
Recently, semi-supervised learning algorithms for phonetic classifiers have been proposed that have obtained promising results. Often, these algorithms attempt to satisfy learning criteria that are not inherent in the standard generative or discriminative training procedures for phonetic classifiers. Graph-based learners in particular utilize an objective function that not only maximizes the cl...
متن کاملAN INVESTIGATION OF SMOOTHNESS MEASURES FOR SEMI-SUPERVISED LEARNING ON GRAPHS By
In semi-supervised learning on graphs, response variables observed at one node are used to estimate missing values at other nodes. The methods depend on smoothness measures to regularize predictions toward smoother answers. In this paper, we investigate two popular choices of smoothness measures based on the graph Lapla-cian. We show on three graph datasets the surprising result that these meas...
متن کاملSupervised neighborhood graph construction for semi-supervised classification
Graph based methods are among the most active and applicable approaches studied in semi-supervised learning. The problem of neighborhood graph construction for these methods is addressed in this paper. Neighborhood graph construction plays a key role in the quality of the classification in graph based methods. Several unsupervised graph construction methods have been proposed that have addresse...
متن کامل